import java.util.Scanner;

public class Test {


    public static void main1(String[] args) {
        Scanner scanner = new Scanner(System.in);

    }

    public static void main(String[] args) {
        BinaryTree binaryTree = new BinaryTree();
        BinaryTree.TreeNode node = binaryTree.creatTree();

        System.out.println("前序遍历：" );
        binaryTree.preOrder(node);
        System.out.println();
        binaryTree.preOrderNor(node);
        System.out.println();
        System.out.println("中序遍历：" );
        binaryTree.inOrder(node);
        System.out.println();
        binaryTree.inOrderNor(node);
        System.out.println();
        System.out.println("后序遍历：" );
        binaryTree.postOrder(node);
        System.out.println();
        binaryTree.postOrderNor(node);
        System.out.println();
        System.out.println("层序遍历：" );
        binaryTree.levelOrder(node);
 /*       *//*binaryTree.size(node);
        System.out.println("树节点个数为：" + binaryTree.usedSize);*//*
        System.out.println("树节点个数为：" + binaryTree.size1(node));

        binaryTree.getLeafNodeCount(node);
        //System.out.println("叶子节点的个数：" + binaryTree.size);
        System.out.println("叶子节点的个数：" + binaryTree.getLeafNodeCount1(node));

        System.out.println("第K层节点的个数：" + binaryTree.getKLevelNodeCount(node,4));
        System.out.println("第K层节点的个数：" + binaryTree.getKLevelNodeCount1(node,3));

        System.out.println("二叉树的高度为: " + binaryTree.getHeight(node));

        System.out.println(binaryTree.find(node,'E'));
*/

    }
}
